State metrics based stopping criterion for turbo-decoding

ABSTRACT

A stopping criterion for a turbo-encoding method. The criterion is based on a state metrics calculated by a forward-backward recursion in a coding trellis of an elementary encoder. If, for at least one elementary decoding stage, forward state metrics of a last symbol of a block or backward state metrics of a first symbol of a block exceeds a first threshold, the turbo-decoding iterations are stopped. If it is not the case, it is further checked whether the state metrics exceeds a second threshold and if the absolute value of the difference between the current state metrics and the state metrics obtained at the previous iteration lies below a given margin. In the affirmative, the turbo-decoding iterations are stopped and a hard decision is taken on extrinsic values.

TECHNICAL FIELD

The present application relates to the field of turbo codes and more particular to turbo-decoding.

PRIOR ART

The turbo-codes were introduced by C. Berrou et al. in the seminal article entitled “Near Shannon limit error-correcting coding and decoding: Turbo Codes”, Proceedings of ICC' 93 pp. 1064-1070, have encountered since then widespread success. The remarkable performances of the turbo-codes in terms of bit error rate or BER (Bit Error Rate), close to those of random coding, are explained by the presence of one or more interleaver(s) between different elementary coders. They are used as error correcting codes in many digital communication standards.

In its most common form, a turbo-encoder can be regarded as a parallel or a serial concatenation of systematic elementary encoders separated by interleavers.

At the receiving side, turbo-decoding is achieved by an iterative process involving as many elementary decoders as the turbo-encoder has elementary encoders, each iteration improving the reliability of the decoded codeword.

FIG. 1 illustrates an example of the structure of a turbocoder comprising two parallel concatenated elementary recursive systematic convolutional (RSC) encoders.

In this example, a block of information bits, I, are coded by two elementary encoders of the systematic convolutional type, arranged in parallel. Each elementary encoder is constituted by a (shared) systematic path, leaving by definition the information bits unchanged, and by a convolutional encoder. The first convolutional encoder 110 outputs parity bits P₁ as a function of the information bits I. The block of parity bits is hereafter referred to as the first redundancy part. Similarly, the second convolutional encoder 120 outputs second parity bits P₂ as a function of the information bits I previously interleaved by the interleaver 130. The block of parity bits P₂ is referred to as the second redundancy part.

The multiplexer 150 multiplexes the information bits I (systematic part) with the parity bits P₁ (first redundancy part) and P₂ (second redundancy part) before transmission over the communication channel 160. More specifically, the multiplexed bits are converted into M-ary symbols (where M is the cardinal of the modulation alphabet) prior to carrier modulation.

FIG. 2 illustrates an example of turbo-decoder for decoding a block encoded by the turbo-encoder of FIG. 1.

The turbo-decoder comprises a first elementary decoder 210 corresponding to encoder 110, a second elementary decoder 220 corresponding to encoder 120. The decoders are of the SISO type (Soft In Soft Out) and may carry out the MAP (Maximum A posteriori Probability) decoding algorithm or one of its derivatives e.g. the Log-MAP or Max-Log-MAP decoding algorithm as known in the art.

The turbo-decoder receives from the symbol demodulator a noisy version of the information bits, the first parity bits and the second parity bits, respectively denoted Ĩ, {tilde over (P)}₁ and {tilde over (P)}₂. The systematic bits Ĩ and first parity bits {tilde over (P)}₁ are supplied to the first elementary decoder 110. The first elementary decoder also inputs a priori information (also called extrinsic information) from the second elementary decoder.

Similarly, the second elementary decoder 220 inputs the received information bits Ĩ, after having being interleaved in interleaver 230, along with the received parity bits {tilde over (P)}₂. The second elementary decoder additionally inputs extrinsic information from the first elementary decoder after it has been interleaved in interleaver 230′. The interleavers 230 and 230′ exhibit the same interleaving pattern H as interleaver 130. The extrinsic information provided by the second decoder is de-interleaved in de-interleaver 240 before being supplied to the first elementary decoder. The de-interleaver has the inverse interleaving pattern Π⁻¹ of interleaver 130.

The encoded block is subjected to iterative decoding, each decoding iteration comprising a first half-iteration in decoder 210 and a subsequent second half-iteration in decoder 220. The update and exchange of extrinsic information, i.e. of the extrinsic values relative to the different information bits, between the first and second elementary decoder, at each iteration, increases the reliability of the decoded block. It should be noted that the extrinsic information of the first decoder is initialized at values indicative of a lack of prior knowledge of bit reliability (0 if LLR values are used).

The extrinsic information is classically expressed in terms of soft values, e.g. LLRs (Log Likelihood Ratios) indicating the reliability of the decoding of each binary symbol. After completion of a given number of iterations or, more generally, when a predetermined stopping criterion is met, the decoding process is stopped and a hard decision is taken in 250 on the soft values to provide hard bit values. The hard decision is taken by performing a simple comparison with a given threshold (0 in case of LLR values).

The power consumption and the latency linearly depend upon the number of iterations of the decoder. It is therefore important to design an efficient stopping criterion, which does not lead to unnecessary iterations while simultaneously achieving a reasonable level of reliability of the decoded values.

Several stopping criteria have been proposed in the literature, based on soft and/or hard values.

US2007/0300139 discloses a stopping criterion based on the comparison of the LLR values output by an elementary decoder for two consecutive iterations. The implementation of such a stopping criterion requires however large storage capacity since a soft value (e.g. coded with a byte) has to be stored for each binary symbol of the block.

EP-A-1455457 further proposes to compare the minimum absolute value of the LLR values of an block with a given threshold. Once this minimum absolute value exceeds the threshold, the iterative decoding process is stopped. In other words, the decoding process stops when the reliability level of the less reliable bit is high enough.

In practice, this stopping criterion is quite sensitive to the threshold value. A too high threshold may result in a frequent rejection of correctly decoded blocks.

An alternative stopping criterion is based on the cross entropy of the LLR related to two consecutive iterations. This criterion is efficient but requires extra computation and considerable memory capacity.

Further stopping criteria are based on monitoring the sign changes in the extrinsic information related to two consecutive iterations. Indeed if a sign of a soft value oscillates from on iteration to the text, this indicates that the corresponding bit is not yet reliable. This stopping criterion requires considerable memory capacity, as the signs of the LLR values for at least two blocks of extrinsic information need to be stored.

The aim of the present invention is therefore to propose a new stopping criterion for a turbodecoding process, which is robust without needing computational overhead or large memory capacity.

DISCLOSURE OF THE INVENTION

The present invention is defined in the appended independent claims. Various advantageous embodiments are given in the dependent claims.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will be better understood from the description of the following embodiments, by way of illustration and in no way limitative thereto:

FIG. 1 schematically illustrates an example of turbo-encoder known from the prior art;

FIG. 2 schematically illustrates an example of turbo-decoder known from the prior art;

FIG. 3 schematically illustrates a coding path in the trellis diagram of an elementary encoder of the turbo-encoder;

FIG. 4 schematically represents forward state metrics and backward state metrics used in the forward-backward decoding algorithm;

FIG. 5A illustrates the evolution of the forward state metrics of the last block symbol for consecutive turbo-decoding iterations;

FIG. 5B illustrates the evolution of the state metrics for the various symbols of the block and consecutive turbo-decoding iterations;

FIG. 6 schematically represents a flowchart of a turbo-decoding method using a stopping criterion according to an embodiment of the invention.

DETAILED DISCLOSURE OF PARTICULAR EMBODIMENTS

We will consider again in the following a turbo-decoder for decoding blocks of binary symbols which have been encoded by a turbo-encoder. The term block can be construed here as a frame or a codeword. The binary symbols processed by the turbo-decoder are expressed in terms of soft values (soft information), typically in terms of LLRs as known in the art.

The turbo-encoder may be constituted by a plurality P of parallel or serially concatenated elementary encoders or a combination of such serial and parallel concatenated elementary encoders (hybrid turbo-encoder). Without loss of generality we will assume that the elementary encoders are RSC (Recursive Systematic Convolutional) encoders. It will nevertheless be understood by the man skilled in the art that other types of encoders can be used while remaining in the scope of present invention.

The turbo-decoder is constituted by the same plurality P of elementary decoders and performs an iterative decoding process as set out above. It is recalled that each elementary decoder corresponds to an elementary encoder of the turbo-encoder and processes the same kind of information as the one output by the corresponding elementary encoder. More specifically, each elementary decoder inputs the systematic part of the received block (e.g. after propagation over the communication channel), possibly interleaved, and a redundancy part corresponding to the one generated by said elementary encoder. In addition, the elementary decoder receives extrinsic information from at least another elementary decoder. Each elementary decoder generates its own extrinsic information from the input systematic part, redundancy part and extrinsic information. The extrinsic information thus generated is supplied in turn to at least another elementary decoder.

Before describing the operation of an elementary decoder, we first consider the corresponding elementary coder in the turbo-encoder. This elementary encoder, as any convolutional encoder, can be regarded as a finite state machine, the transitions of which are determined by the generator polynomial. If the memory of the encoder is of size v (v shift register stages), the finite state machine may take 2^(v) states, each state being defined by the contents of the memory. It should be noted that the various elementary encoders of the turbo-encoder may have different memory sizes (i.e. shift registers having different lengths) and hence different numbers of states.

The coding operation may be regarded as a coding path in a trellis diagram as represented in FIG. 3.

Conventionally, the states of the encoder are represented vertically by circles whereas the horizontal direction is the time axis. Each column of states corresponds to a clock cycle. At each input bit, on progresses rightwards (or forward) in the trellis, and the encoder goes from a state a time k to a subsequent state at time k+1. The transition between the state at time k and the state at time k+1 is therefore represented by an edge in the trellis (and by an arc in the state diagram). The coding of a block of bits results therefore in a path within the trellis. At each time k, the encoder outputs a parity bit (in addition to the systematic bit), which depends upon the state of the encoder and the input bit.

The corresponding elementary decoder implements a forward-backward algorithm as know in the art. By forward-backward algorithm we mean here the MAP decoding algorithm or one of its derivatives such as the Log-MAP or the Max-Log-MAP algorithm. A description of the MAP algorithm can be found in the original paper of Bahl et al. entitled “Optimal decoding of linear codes for minimizing symbol error rate” published in IEEE Trans. on Information Theory, pp. 284-287, March 1974. A description of the Max-Log-MAP algorithm can be found e.g. in the article of C. Hye-Mi et al. entitled “Low power hybrid turbo decoding based in reverse calculation, ISCAS 2006.

The forward-backward decoding algorithm is based on the same trellis as the coding trellis described above. More specifically, the forward-backward decoding algorithm mainly comprises three steps: a forward recursion, a backward recursion and an LLR calculation.

In the forward recursion, the algorithm recursively calculates the forward state probability of being in each state of the trellis at each time k given the knowledge of all the previous received symbols. The forward state probability, also called forward state metrics, is recursively obtained by:

$\begin{matrix} {{{\alpha_{k}(s)} = {\sum\limits_{s^{\prime}}^{\;}\; {{\alpha_{k - 1}\left( s^{\prime} \right)}{\gamma_{k}\left( {s^{\prime},s} \right)}}}}{{k = 1},{{\ldots \mspace{14mu} N} - 1}}} & (1) \end{matrix}$

where s is the current state and s′ is the preceding state, α_(k−1)(s′) is the forward state probability of being at state s′ at time k−1, and γ_(k)(s′,s) is the branch probability of the transition between state s′ and state s, given the received symbol, N is the size of the block. The state s′ at the beginning of the transition s′→s will be referred to as the transition starting state whereas the state will be referred to as the transition ending state. The branch probability is also called the branch metrics.

The forward recursion is initialized by forcing the starting state to state 0 and setting:

α₀(0)=1 and α₀(s)=0 for s≠0   (2)

FIG. 4 schematically illustrates how the forward state metrics α_(k)(s) is calculated for a state s of the trellis. At time k, the forward state metrics of state s is calculated (by expression (1)) from the forward state metrics of the possible preceding states s′ (in grey) at time k−1 (i.e. those corresponding to an authorized transition s′→s), α_(k−1)(s), and the transition metrics between states s and s′, γ_(k)(s′,s).

Similarly, in the backward recursion, the algorithm recursively calculates the backward state probability of being in each state of the trellis at each time k given the knowledge of all the following symbols at time k+1. The backward state probability, also called backward state metrics, is recursively obtained by:

$\begin{matrix} {{{\beta_{k - 1}\left( s^{\prime} \right)} = {\sum\limits_{s}^{\;}\; {{\beta_{k}(s)}{\gamma_{k}\left( {s^{\prime},s} \right)}}}}{{k = N},\ldots \mspace{14mu},2}} & (3) \end{matrix}$

As illustrated in FIG. 4, the backward state metrics at time k is calculated from the backward state metrics of the possible following states s (nodes shaded in grey) at time k+1, β_(k+1)(s), and the transition metrics between states s and s′, γ_(k+1)(s′,s).

The backward recursion is initialized by forcing the ending state to state 0 and setting:

β_(N)(0)=1 and β_(N)()=0 for ≠0   (4)

The output LLR for each bit u_(k) at time k is given by:

$\begin{matrix} {{L\left( u_{k} \right)} = {{\ln \frac{P\left( {u_{k} = {{+ 1}y_{k}}} \right)}{P\left( {u_{k} = {{- 1}y_{k}}} \right)}} = {\ln \frac{\sum\limits_{{{({s^{\prime},s})}\mspace{11mu} u_{k}} = {+ 1}}^{\;}\; {{\alpha_{k - 1}\left( s^{\prime} \right)}{\gamma_{k}\left( {s^{\prime},s} \right)}{\beta_{k}(s)}}}{\sum\limits_{{{({s^{\prime},s})}\mspace{11mu} u_{k}} = {- 1}}^{\;}\; {{\alpha_{k - 1}\left( s^{\prime} \right)}{\gamma_{k}\left( {s^{\prime},s} \right)}{\beta_{k}(s)}}}}}} & (5) \end{matrix}$

where y₄ is the modulation symbol received on the communication channel at time k and where the bit values have been noted ±1. The upper summation in (5) is carried out over all branches with input label +1 and the lower summation is carried out over all branches with input label −1.

For an AWGN (Additive White Gaussian Noise) channel, the branch metrics γ_(k)(s,s′) can be obtained as:

$\begin{matrix} {{\gamma_{k}\left( {s^{\prime},s} \right)} = {\exp \left( {- \frac{{{y_{k} - x_{k}}}^{2}}{2\; \sigma^{2}}} \right)}} & (6) \end{matrix}$

where σ² is the noise variance and x_(k) is the expected symbol for the transition s′ to s. Therefore, the γ_(k)(s′,s) values can be calculated at each turbo-decoding iteration.

The expressions (1)-(6) refer to the MAP algorithm. They can be simplified by using logarithmic values (Log-MAP algorithm) and even further simplified by retaining only the most significant values under the summation signs (Max-Log-MAP algorithm). In the latter case, denoting {hacek over (ρ)} for ln ρ:

$\begin{matrix} {\mspace{85mu} {{{\overset{\Cup}{\alpha}}_{k}(s)} = {\max\limits_{s^{\prime}}\mspace{14mu} \left\lbrack {{{\overset{\Cup}{\alpha}}_{k - 1}\left( s^{\prime} \right)} + {{\overset{\Cup}{\gamma}}_{k}\left( {s^{\prime},s} \right)}} \right\rbrack}}} & \left( 1^{\prime} \right) \\ {\mspace{79mu} {{{{\overset{\Cup}{\alpha}}_{0}(0)} = 0}\mspace{79mu} {and}\mspace{79mu} {{{\overset{\Cup}{\alpha}}_{0}(s)} = {- \infty}}\mspace{79mu} {{{for}\mspace{14mu} s} \neq 0}}} & \left( 2^{\prime} \right) \\ {\mspace{76mu} {{{\overset{\Cup}{\beta}}_{k - 1}\left( s^{\prime} \right)} = {\max\limits_{s^{\prime}}\mspace{14mu} \left\lbrack {{{\overset{\Cup}{\beta}}_{k}(s)} + {{\overset{\Cup}{\gamma}}_{k}\left( {s^{\prime},s} \right)}} \right\rbrack}}} & \left( 3^{\prime} \right) \\ {\mspace{79mu} {{{{\overset{\Cup}{\beta}}_{N}(0)} = 0}\mspace{79mu} {and}\text{}\mspace{79mu} {{{\overset{\Cup}{\beta}}_{N}(s)} = {- \infty}}\mspace{79mu} {{{for}\mspace{14mu} s} \neq 0}}} & \left( 4^{\prime} \right) \\ {{{L\left( u_{k} \right)}{\max\limits_{{{{({s^{\prime},\; s})}\; u_{k}} = {+ 1}}\;}\mspace{14mu} \left\lbrack {{{\overset{\Cup}{\alpha}}_{k - 1}\left( s^{\prime} \right)} + {{\overset{\Cup}{\gamma}}_{k}\left( {s^{\prime},s} \right)} + {{\overset{\Cup}{\beta}}_{k}(s)}} \right\rbrack}} - {\max\limits_{{{{({s^{\prime},\; s})}\; u_{k}} = {- 1}}\;}\mspace{14mu} \left\lbrack {{{\overset{\Cup}{\alpha}}_{k - 1}\left( s^{\prime} \right)} + {{\overset{\Cup}{\gamma}}_{k}\left( {s^{\prime},s} \right)} + {{\overset{\Cup}{\beta}}_{k}(s)}} \right\rbrack}} & \left( 5^{\prime} \right) \\ {\mspace{79mu} {{{\overset{\Cup}{\gamma}}_{k}\left( {s^{\prime},s} \right)} = {{- {\frac{1}{2\; \sigma^{2}}\left\lbrack {{y_{k}}^{2} + {x_{k}}^{2}} \right\rbrack}} + {\frac{1}{\sigma^{2}}\left( {y_{k} \cdot x_{k}} \right)}}}} & \left( 6^{\prime} \right) \end{matrix}$

As the first term between brackets is common to all branch metrics, it can be dropped for the purpose of calculating (1′), (3′) and (5′), in other words:

$\begin{matrix} {{{\overset{\Cup}{\gamma}}_{k}\left( {s^{\prime},s} \right)} = {\frac{1}{\sigma^{2}}\left( {y_{k},x_{k}} \right)}} & \left( 6^{''} \right) \end{matrix}$

In expressions (6) or (6″), the only changing parameter is x_(k)·x_(k) is a P+1 dimension vector (assuming one parity bit per elementary coder), the elements of which are the systematic bit, denoted x_(k) ^(s) and the parity bits denoted x_(k) ^(r) ^(p) , p=1, . . . , P. The soft value of the systematic bit in (6) or (6″) is replaced by:

x _(k) ^(s) =y _(k) ^(s) +L _(e)(u _(k))   (7)

where L_(e)(u_(k)) is the extrinsic information provided from another elementary decoder. Therefore, the γ_(k)(s′,s) values can be calculated at each turbo-decoding iteration.

The forward state metrics of the last symbol of the block can be regarded as a cumulated metrics along the expected coding path in trellis, when travelled through in the forward direction. Similarly, the backward state metrics of the first symbol can be regarded as a cumulated metrics along the expected coding path in the trellis, when travelled through in the backward direction.

In general, the state metrics (either forward or backward) increases along the travelled path. For example, if the Max-Log-MAP algorithm is used, the forward state metrics increases between the first symbol and the last symbol from 0 to the cumulated value:

$\begin{matrix} {{{\overset{\Cup}{\alpha}}_{N}(s)} = {\max\limits_{s^{\prime}}\mspace{14mu} \left( {\sum\limits_{k = 1}^{N}\; {{\overset{\Cup}{\gamma}}_{k}\left( {s^{\prime},s} \right)}} \right)}} & (8) \end{matrix}$

and, similarly, the backward state metrics increases between the last symbol and the first symbol from 0 to the same cumulated value:

$\begin{matrix} {{{\overset{\Cup}{\beta}}_{0}(s)} = {\max\limits_{s^{\prime}}\mspace{14mu} \left( {\sum\limits_{k = 1}^{N}\; {{\overset{\Cup}{\gamma}}_{k}\left( {s^{\prime},s} \right)}} \right)}} & (9) \end{matrix}$

This cumulated value reflects the likelihood of the considered coding path. In the remaining part of the description, it should be understood that the coding path referred to is the one exhibiting the highest likelihood.

FIG. 5A represents the cumulated value α_(N)[i] of the forward state metrics of the considered coding path, for a plurality of consecutive iterations i. The curves 510 correspond to different blocks of symbols and a SNR value of 1.1 dB.

It should be noticed that the forward state metrics saturates after 4 or 5 iterations. In other words, the cumulated value of the forward state metrics is a good indicator of the convergence of the turbo-decoding. Similarly, the backward state metrics saturates after a few iterations and is therefore an equivalent indicator of convergence.

FIG. 5B illustrates the variation of the forward state metrics α_(k)[i] add along the considered coding path, k=0, . . . , N for consecutive turbo-decoding iterations.

For each iteration, the forward state metrics ramps up from the first symbol to the last (N^(th)) symbol of the block. As already noticed in FIG. 6, the cumulated value, α_(N), reached at the N^(th) symbol of the block, increases as the turbo-decoding proceeds and then saturates after a few iterations.

A first stopping criterion according to the present invention consists in comparing the cumulated value of the forward state metrics (resp. the backward state metrics) with a predetermined threshold a_(th) (resp. β_(th)). This threshold, hereinafter referred to as first threshold, can be tuned by simulation to the block length and the expected SNR (Signal to Noise Ratio). If the cumulated value at iteration i is greater than said threshold, i.e. if:

α_(N) [i]>α _(th) (resp. β_(N) [i]>β _(th))   (10)

the turbo-decoding iterations are stopped.

A second stopping criterion can be combined with the first in order to enhance its robustness. More specifically, if the cumulated value of the forward state metrics (resp. backward state metrics) does not meet the first stopping criterion, it is checked whether a second stopping criterion:

α_(N) [i]>α′ _(th) and |α_(N) [i]−α _(N) [i−1]|<Δ_(α)  (11)

(resp. β_(N)[i]>β′_(th) and |β_(N)[i]−β_(N)[i−1]|<Δ_(β)) is met, where α′_(th) (resp. β′_(th)) is a second threshold and Δ_(α) (resp. Δ_(β)) is a margin. In the affirmative, the turbo-decoding iterations are stopped. The second criterion (11) expresses the saturation of the state metrics at a sufficient high level. Typically, the second threshold is lower than the first threshold.

FIG. 6 represents a flowchart of a turbo-decoding method using a stopping criterion according to an embodiment of the invention.

As already mentioned in the outset, the turbo-decoding method consists in a plurality of iterations, each iteration being subdivided into P decoding stages, 610 ₁, . . . , 610 _(P) sequentially performed by thee P elementary decoders.

The stopping criterion is implemented here in the p^(th) decoder. More generally, it is implemented in at least one elementary decoder.

The p^(th) decoder receives the systematic soft bits y_(k) ^(s) and the soft parity bits y_(k) ^(r) ^(P) from the demodulator.

It also inputs the extrinsic values L_(e) ^(p−1)(u_(k)) from the preceding decoder.

We consider here the i^(th) turbo-decoding iteration. The decoding stage 610 _(p) starts with a forward-backward recursion in 611. The forward-backward algorithm can be the MAP, Log-MAP or Max-Log-MAP decoding algorithm.

The state metrics of the last symbol of the block (forward state metrics) or the first symbol of the block (backward state metrics) is calculated at the end of the forward-backward recursion 611 and the first stopping criterion is checked in b 612.

If the state metrics exceeds the first threshold (expression (10), the turbo-encoding exits and a hard decision is taken in 614 on the extrinsic values just obtained from the forward-backward recursion.

In the negative, the second stopping criterion is checked in 613. If the state metrics exceeds the second threshold and if the absolute value of the difference of state metrics between the current iteration and the previous one lies below a predetermined margin, the turbo-encoding exits and a hard decision on the extrinsic values is taken in 614. The turbo-decoding then ends at 615.

Conversely, if neither the first nor the second stopping criterion is met, the iteration proceeds with the next decoding stage 610 _(p+1).

According to a variant (not shown), the first stopping criterion can be implemented alone. However for increased robustness to SNR, the combination of the first and second criteria is preferred.

It will also be understood by the man skilled in the art that the implementation of the first stopping criterion does not require any storage in a memory (no state metrics is stored) and can be checked on the fly with very little additional overhead. 

1-9. (canceled)
 10. A turbo-decoding method for turbo-decoding a block of symbols having been coded by a turbo-encoder, the turbo-decoding comprising: a plurality of iterations, each iteration comprising a plurality of decoding stages, each decoding stage being carried out by an elementary decoder corresponding to an elementary encoder of the turbo-encoder, each decoding stage performing a forward-backward recursion on a coding trellis of the corresponding encoder, the trellis representing various states of the encoder for each symbol of the block; wherein a forward state metrics of the last symbol or a backward state metrics of the first symbol of the block is calculated; wherein the state metrics is compared with a first predetermined threshold; and wherein if the state metrics exceeds the first predetermined threshold, the iterations are stopped.
 11. A turbo-decoding method according to claim 10, wherein if the state metrics does not exceed the first predetermined threshold, it is checked: (a) whether the state metrics exceeds a second predetermined threshold; and (b) if the absolute value of the difference between the state metrics and the state metrics of a previous iteration lies below than a predetermined margin; and if both conditions and are met, the iterations are stopped.
 12. A turbo-decoding method according to claim 11, wherein the second threshold is lower that the first threshold.
 13. A turbo-decoding method according to claim 11, wherein each decoding stage supplies extrinsic values of systematic bits to a next decoding stage and a last decoding stage supplies extrinsic values of the systematic bits to a first decoding stage.
 14. A turbo-decoding method according to claim 13, wherein if the state metrics exceeds the first threshold, a hard decision is taken on the extrinsic values supplied by the at least one decoding stage to provide hard decided systematic bits.
 15. A turbo-decoding method according to claim 13, wherein if conditions (a) and (b) are met, a hard decision is taken on the extrinsic values supplied by the at least one decoding stage to provide hard decided systematic bits.
 16. A turbo-decoding method according to claim 10, wherein the forward-backward recursion is performed according to a MAP decoding algorithm.
 17. A turbo-decoding method according to claim 10, wherein the forward-backward recursion is performed according to a Log-MAP decoding algorithm.
 18. A turbo-decoding method according to claim 10, wherein the forward-backward recursion is performed according to a Max-Log-MAP decoding algorithm. 